Fixed-parameter tractability of integer generalized scoring rules
نویسنده
چکیده
We prove that for any integer generalized scoring rules (GSRs), winner determination and computing a wide range of strategic behavior are fixed-parameter tractable (FPT) w.r.t. the number of alternatives.
منابع مشابه
A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes
The POSSIBLE WINNER problem asks whether some distinguished candidate may become the winner of an election when the given incomplete votes are extended into complete ones in a favorable way. POSSIBLE WINNER is NP-complete for common voting rules such as Borda, many other positional scoring rules, Bucklin, Copeland etc. We investigate how three different parameterizations influence the computati...
متن کاملElection Attacks with Few Candidates
We investigate the parameterized complexity of strategic behaviors in generalized scoring rules. In particular, we prove that the manipulation, control (all the 22 standard types), and bribery problems are fixed-parameter tractable for most of the generalized scoring rules, with respect to the number of candidates. Our results imply that all these strategic voting problems are fixed-parameter t...
متن کاملBounded fixed-parameter tractability and reducibility
We study a refined framework of parameterized complexity theory where the parameter dependence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a function in some familyF . For every family F of functions, this yields a notion of F -fixed parameter tractability. If F is the class of all polynomially bounded functions, then F -fixed parameter tractability coincides wit...
متن کاملExperiments with the Fixed-Parameter Approach for Two-Layer Planarization
We present computational results of an implementation based on the fixed parameter tractability (FPT) approach for biplanarizing graphs. These results show that the implementation can efficiently minimum biplanarizing sets containing up to about 18 edges, thus making it comparable to previous integer linear programming approaches. We show how our implementation slightly improves the theoretical...
متن کاملPolynomial-Time Data Reduction for the Subset Interconnection Design Problem
The NP-hard Subset Interconnection Design problem, also known as Minimum Topic-Connected Overlay, is motivated by numerous applications including the design of scalable overlay networks and vacuum systems. It has as input a finite set V and a collection of subsets V1, V2, . . . , Vm ⊆ V , and asks for a minimum-cardinality edge set E such that for the graph G = (V, E) all induced subgraphs G[V1...
متن کامل